A State Assignment Technique for Sequential Machines Using J-K Flip-Flops
نویسندگان
چکیده
Several techniques for choosing state assignments which tend to minimize the combinational input and output circuitry of sequential machines have been developed. One of these techniques is a heuristic scoring approach which was originally developed assuming delays as memory elements [1]. This technique was later expanded to cover the cases when trigger flip-flops or combinations of trigger flip-flops and delays were used as memory elements [2]. In this correspondence the hueristic scoring approach developed by Dolotta and McCluskey will be expanded to cover the case when J-K flip-flops are used as memory elements. It will be shown that the relative importance of various features when using delays as memory elements is not the same as when J-K flip-flops are used. Also, a new set of scores for J-K flip-flops based on the relative importance of various features will be developed. When delays are used as memory elements, the following octal scores are assigned for various features: 20 for an all-zero entry 10 for an all-one entry 20 for adjacency 4 for identity with the base entry 4 for complement of base entry. Each feature will now be examined to see how it applies when J-K flip-flops are used, and new scores will be assigned to some features. With J-K flip-flops, if a column entry is identical to a base entry, the JandK inputs of the flip-flop will be ZERO's and DON'T CARE's. This is equivalent to the condition which exists for an all-zero entry when delays are used as memory elements. Thus when J-K flip-flops are used, identity with the base entry will be given a score of octal 20. For an all-zero column entry, when J-K flip-flops are used, the J inputs will be ZERO's and DON'T CARE's and the K inputs will be ONE's and DON'T CARE's. Similarly, for an all-one column entry, the J inputs will be ONE's and DON'T CARE's and the K inputs will be ZERO's and DON'T CARE's. Since the occurrence of a one onaJorKinputmay require a gate function, an all-zero or all-one column entry is not as desirable as a column entry which is identical to the base entry. If a column entry is the complement of a base entry when using J-K flip-flops, both the J and K inputs will be ONE's and DON'T CARE's.
منابع مشابه
Applications of Fuzzy Program Graph in Symbolic Checking of Fuzzy Flip-Flops
All practical digital circuits are usually a mixture of combinational and sequential logic. Flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. The concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...
متن کاملCritically Analyzing the Behavior of Fuzzy Flip Flops and Searching for Better Solutions
Abstract— Sequential circuits are the important components of a computer system as they process binary data and buffers binary output for the next period.. Sequential circuits are the interconnection of logic gates and Flip Flops and the buffering of binary output for the next period is carried out by the Flip Flops by their inherent feedback mechanism. Sequential circuits basically process bin...
متن کاملMinimal realization of sequential machines : the method of maximal adjacencies
Reducing the amount of hardware needed for implementing a sequential machine is very important. The problem of, in the strict sense, minimal realization of sequential machines is difficult and it is entirely unsolved (except complete enumeration). Typically, this problem can be replaced with a number of subproblems such as: state minimization, state assignment, choice of flip-flops and minimiza...
متن کاملTest application time reduction for scan based sequential circuits
This paper addresses the issue of reducing test application time in sequential circuits with partial scan using a single clock configuration without freezing the state of the non-scan flip-flops. Experimental results show that this technique significantly reduces test application time. Further, we study the effect of ordering the scan flip-flops on the test vector length and also present a non-...
متن کاملDesign Diversity for Concurrent Error Detection in Sequential Logic Circuts
We present a technique using diverse duplication to implement concurrent error detection (CED) in sequential logic circuits. We examine three different approaches for this purpose: (1) Identical state encoding of the two sequential logic implementations, duplication of flip-flops, diverse implementation of the combinational logic part (output logic and next-state logic) and comparators on flip-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 23 شماره
صفحات -
تاریخ انتشار 1974